COMPUTER SCIENCE TRIPOS Part II – 2015 – Paper 9 1 Bioinformatics (PL) (a) Define the Longest Common Subsequence (LCS) problem between two strings and find a solution for the case of the two strings:

Source URL: www.cl.cam.ac.uk

UC Berkeley—CS 170: Efficient Algorithms and Intractable Problems Lecturer: David Wagner Handout 13 March 13, 2003

Source URL: www.cs.berkeley.edu

• Control theory
• Longest common subsequence problem
• Algorithm
• Substring
• Longest common substring problem
• Fibonacci number
• Overlapping subproblems
• Longest increasing subsequence
• Dynamic programming
• Mathematics
• Applied mathematics

A global averaging method for dynamic time warping, with applications to clustering Franc¸ois Petitjeana,b,c,∗, Alain Ketterlina , Pierre Ganc¸arskia,b a University of Strasbourg, 7 rue Ren´e Descartes, 67084 Strasb

Source URL: dpt-info.u-strasbg.fr

• Bioinformatics
• Dynamic time warping
• Time series analysis
• Computational phylogenetics
• Computational linguistics
• Speech recognition
• Sequence
• Cluster analysis
• Longest common subsequence problem
• Statistics
• Dynamic programming
• Mathematics

ICS 161 — Algorithms — Spring 2005 — Final Exam Please answer the following eight questions on the answer sheets provided. Answers written on other pages or on the wrong sheet will not be scored. Be sure to write y

Source URL: www.ics.uci.edu

• NP-complete problems
• Vertex cover
• NP-complete
• Longest common subsequence problem
• Minimum spanning tree
• Algorithm
• Path decomposition
• Edge coloring
• Theoretical computer science
• Computational complexity theory
• Mathematics

An O(ND) Difference Algorithm and Its Variations∗ EUGENE W. MYERS Department of Computer Science, University of Arizona, Tucson, AZ 85721, U.S.A. ABSTRACT

Source URL: xmailserver.org

• Operations research
• NP-complete problems
• Dynamic programming
• Equations
• Systems engineering
• Shortest path problem
• Longest common subsequence problem
• Graph
• Catalan number
• Mathematics
• Theoretical computer science
• Graph theory

Time-Space Trade-Offs for the Longest Common Substring Problem Tatiana Starikovskaya1 and Hjalte Wedel Vildhøj2 1 Moscow State University, Department of Mechanics and Mathematics,

Source URL: www.cs.ucr.edu

• Applied mathematics
• Combinatorics
• Longest common subsequence problem
• Substring
• Longest common substring problem
• Suffix tree
• Dynamic programming
• Mathematics
• Theoretical computer science

Faster Algorithms for Computing Longest Common Increasing Subsequences Gerth Stølting Brodal Kanela Kaligosi

Source URL: www.cs.ucr.edu

• Formal languages
• Longest increasing subsequence
• Subsequence
• Longest common subsequence problem
• Ordinal number
• Ordinal arithmetic
• Mathematics
• Dynamic programming
• Combinatorics

Semi-local string comparison Alexander Tiskin http://www.dcs.warwick.ac.uk/~tiskin Department of Computer Science University of Warwick

Source URL: www.cs.ucr.edu

• String
• Combinatorics
• NP-complete problems
• Formal languages
• Substring
• Longest common subsequence problem
• Subsequence
• Approximate string matching
• String searching algorithm
• Mathematics
• Dynamic programming
• Theoretical computer science

CS109A Notes for LectureSubstrings In ML notation, x is a substring of y if y = u^x^v for some strings u and v.  Similar notion for lists, i.e., y = u@x@v.

Source URL: infolab.stanford.edu

• Combinatorics
• Formal languages
• Longest common subsequence problem
• String
• Substring
• Subsequence
• Diff
• Shortest common supersequence
• Longest common substring problem
• Mathematics
• Dynamic programming
• Theoretical computer science

Window Subsequence Matching Window Subsequence Problems for Compressed Texts INPUT: Text: C O M P U T E R

Source URL: yury.name

• Dynamic programming
• Combinatorics
• Mathematical optimization
• Logicians
• Yuri Matiyasevich
• Compressed pattern matching
• Longest common subsequence problem
• Substring
• X Window System
• Mathematics
• Software
• Theoretical computer science